Extending partial tournaments
نویسندگان
چکیده
Let A be a (0, 1, ∗)-matrix with main diagonal all 0’s and such that if ai,j = 1 or ∗ then aj,i = ∗ or 0. Underwhat conditions on the row sums, and or column sums, of A is it possible to change the ∗’s to 0’s or 1’s and obtain a tournament matrix (the adjacency matrix of a tournament) with a specified score sequence? We answer this question in the case of regular and nearly regular tournaments. The result we give is best possible in the sense that no relaxation of any condition will always yield a matrix that can be so extended. © 2009 Elsevier Ltd. All rights reserved.
منابع مشابه
Constructions over Tournaments
We investigate tournaments that are projective in the variety that they generate, and free algebras over partial tournaments in that variety. We prove that the variety determined by three-variable equations of tournaments is not locally finite. We also construct infinitely many finite, pairwise incomparable simple tournaments.
متن کاملCountable Homogeneous Tournaments
A tournament Tis called homogeneous just in case every isomorphism of subtournaments of smaller cardinality can be lifted to an automorphism of T. It is shown that there are precisely three homogeneous tournaments of power N(). Some analogous results for 2-tournaments are obtained. In this paper we characterize countable tournaments which are homogeneous in the sense of Fraissé [1]. As far as w...
متن کاملMinimal extending sets in tournaments
In 2011, Brandt proposed a new tournament solution called the minimal extending set (ME). It was conjectured that ME satisfies a large number of desirable properties. In this paper, we non-constructively show that ME fails to satisfy most of these properties. However, no concrete examples of these violations are known and it appears that ME satisfies these properties for all practical purposes....
متن کاملt-Pancyclic Arcs in Tournaments
Let $T$ be a non-trivial tournament. An arc is emph{$t$-pancyclic} in $T$, if it is contained in a cycle of length $ell$ for every $tleq ell leq |V(T)|$. Let $p^t(T)$ denote the number of $t$-pancyclic arcs in $T$ and $h^t(T)$ the maximum number of $t$-pancyclic arcs contained in the same Hamiltonian cycle of $T$. Moon ({em J. Combin. Inform. System Sci.}, {bf 19} (1994), 207-214) showed that $...
متن کاملSome recollections on early work with Jan Pelant
In this note we consider three questions which can be traced to our early collaboration with Jan “Honza” Pelant. We present them from the contemporary perspective, in some cases extending our earlier work. The questions relate to Ramsey Theory, uniform spaces and tournaments. Mathematics Subject Classification: primary 05C55, secondary 05C20 54E15.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematical and Computer Modelling
دوره 50 شماره
صفحات -
تاریخ انتشار 2009